Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Red mariposa")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 13 of 13

  • Page / 1
Export

Selection :

  • and

Layouts for Sparse Networks Supporting Throughput ComputingLEPPÄNEN, Ville; PENTTONEN, Martti; FORSELL, Martti et al.Parallel and distributed processing techniques and applications. International conferenceWorldComp'2010. 2010, pp 443-449, isbn 1-60132-156-2 1-60132-157-0 1-60132-158-9, 7 p.Conference Paper

Faster gossiping on butterfly networksSIBEYN, Jop F.Theoretical computer science. 2005, Vol 331, Num 1, pp 53-72, issn 0304-3975, 20 p.Conference Paper

The Forwarding Indices of Wrapped Butterfly NetworksXINMIN HOU; XU, Jun-Ming; MIN XU et al.Networks (New York, NY). 2009, Vol 53, Num 4, pp 329-333, issn 0028-3045, 5 p.Article

Design of an asynchronous switch based on butterfly fat-tree for network-on-chip applicationsKANG, Min-Chang; JUNG, Eun-Gu; HAR, Dong-Soo et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-30027-9, 2Vol, Part II, 538-549Conference Paper

Ulysses: a robust, low-diameter, low-latency peer-to-peer networkKUMAR, Abhishek; MERUGU, Shashidhar; JIM, Jun et al.European transactions on telecommunications. 2004, Vol 15, Num 6, pp 571-587, issn 1124-318X, 17 p.Article

Mapping cycles and trees on wrap-around butterfly graphsWAGH, Meghanad D; GUZIDE, Osman.SIAM journal on computing (Print). 2006, Vol 35, Num 3, pp 741-765, issn 0097-5397, 25 p.Article

Parceling the Butterfly and the Batcher Sorting NetworkLITMAN, Ami.Theoretical computer science (essays in memory of Shimon Even). Lecture notes in computer science. 2006, pp 129-142, issn 0302-9743, isbn 3-540-32880-7, 1Vol, 14 p.Book Chapter

Systolic routing in an optical butterflyHONKANEN, Risto T.Lecture notes in computer science. 2005, pp 141-150, issn 0302-9743, isbn 3-540-28126-6, 10 p.Conference Paper

Ranks of graphs : The size of acyclic orientation cover for deadlock-free packet routingKRALOVIC, R; RUZICKA, P.Theoretical computer science. 2007, Vol 374, Num 1-3, pp 203-213, issn 0304-3975, 11 p.Article

2-Dilated flattened butterfly: A nonblocking switching topology for high-radix networksTHAMARAKUZHI, Ajithkumar; CHANDY, John A.Computer communications. 2011, Vol 34, Num 15, pp 1822-1835, issn 0140-3664, 14 p.Article

An Analysis of Reducing Communication Delay in Network-on-Chip Interconnect ArchitectureFURHAD, Hasan; HAQUE, Mohammad A; KIM, Cheol-Hong et al.Wireless personal communications. 2013, Vol 73, Num 4, pp 1403-1419, issn 0929-6212, 17 p.Article

Edge-disjoint spanning trees for the generalized butterfly networks and their applicationsTOUZENE, Abderezak; DAY, Khaled; MONIEN, Burkhard et al.Journal of parallel and distributed computing (Print). 2005, Vol 65, Num 11, pp 1384-1396, issn 0743-7315, 13 p.Article

Wirelength of 1-fault hamiltonian graphs into wheels and fansAROCKIARAJ, M; MANUEL, Paul; RAJASINGH, Indra et al.Information processing letters. 2011, Vol 111, Num 18, pp 921-925, issn 0020-0190, 5 p.Article

  • Page / 1